Probabilistic Analysis and Verification of the ASW Protocol using PRISM

نویسندگان

  • Salekul Islam
  • Mohammad Abu Zaid
چکیده

The ASW protocol is one of the prominent optimistic fair exchange protocols that is used for contract signing between two participants, the originator and the responder, with the aid of a trusted third party in case of a dispute. In this paper, the key security objectives of ASW protocol — fairness, effectiveness and timeliness — have been verified using a probabilistic model checking tool, PRISM. First, the security objectives of ASW protocol have been defined with probabilistic equations. The roles of the participants (i.e., the originator and the responder) and the trusted third party have been modeled in PRISM code. The security objectives of ASW protocol have been expressed using a temporal logic, PCTL. The PCTL expressions are analogous to the probabilistic equations that we have developed to define the security objectives. Next, the model is analyzed using these PCTL expressions, and different outputs have been observed. The outputs confirm the fairness of the ASW protocol. Moreover, the effectiveness and the timeliness of the protocol are also established. Hence, the key security properties of ASW protocol have been verified.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Probabilistic Verification of Systems with a Large State Space

The probabilistic verification technique presented in this paper computes a bound for error probability, even when the state space is too large to be traversed completely. Very large state spaces occur in multi-party protocols that are needed for collaborative intelligent vehicles. Most other verification techniques are not useful because they cannot generate all of the reachable states and det...

متن کامل

Verifying Team Formation Protocols with Probabilistic Model Checking

Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of efficient collaboration protocols, a typical example of which is team formation. In this paper, we illustrate how probabilistic model checking, a technique for formal verification of probabilistic systems, can be applied t...

متن کامل

Analysis of Probabilistic Contract Signing

We consider the probabilistic contract signing protocol of Ben-Or, Goldreich, Micali, and Rivest as a case study in formal verification of probabilistic security protocols. Using the probabilistic model checker PRISM, we analyse the probabilistic fairness guarantees the protocol is intended to provide. Our study demonstrates the difficulty of combining fairness with timeliness in the context of...

متن کامل

Interactive verification of Markov chains: Two distributed protocol case studies

Probabilistic model checkers like PRISM only check probabilistic systems of a fixed size. To guarantee the desired properties for an arbitrary size, mathematical analysis is necessary. We show for two case studies how this can be done in the interactive proof assistant Isabelle/HOL. The first case study is a detailed description of how we verified properties of the ZeroConf protocol, a decentra...

متن کامل

Quantitative Analysis of a Probabilistic Non-repudiation Protocol through Model Checking

In the probabilistic non-repudiation protocol without a trusted third party as presented in [5], the recipient of a service can cheat the originator of the service with some probability. This probability indicates the degree of fairness of the protocol and is referred as 2-fairness. In this paper, we analyze the protocol quantitatively through probabilistic model checking. The 2-fairness is qua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2008